Complete graph - PDFSEARCH.IO - Document Search Engine

Complete graph
Results: 868

#	Item
381	From the book Networks, Crowds, and Markets: Reasoning about a Highly Connected World. By David Easley and Jon Kleinberg. Cambridge University Press, 2010. Complete preprint on-line at http://www.cs.cornell.edu/home/klei Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 2010-06-10 15:11:50 Graph Connectivity Collaboration graph Tree Topology Directed acyclic graph Graph theory Graph operations Breadth-first search
382	From the book Networks, Crowds, and Markets: Reasoning about a Highly Connected World. By David Easley and Jon Kleinberg. Cambridge University Press, 2010. Complete preprint on-line at http://www.cs.cornell.edu/home/klei Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 2010-06-10 15:11:56 Matching Bipartite graph Game theory Auction theory Graph theory Mathematics Combinatorial optimization
383	From the book Networks, Crowds, and Markets: Reasoning about a Highly Connected World. By David Easley and Jon Kleinberg. Cambridge University Press, 2010. Complete preprint on-line at http://www.cs.cornell.edu/home/klei Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 2010-06-10 15:12:01 Probability theory Preferential attachment Copying mechanism Power law Normal distribution Central limit theorem Long Tail Probability Logarithm Statistics Stochastic processes Graph theory
384	From the book Networks, Crowds, and Markets: Reasoning about a Highly Connected World. By David Easley and Jon Kleinberg. Cambridge University Press, 2010. Complete preprint on-line at http://www.cs.cornell.edu/home/klei Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 2010-06-10 15:11:57 Networks Network analysis Theoretical computer science Algebraic graph theory Centrality Network science Katz centrality Graph theory Network theory Mathematics
385	From the book Networks, Crowds, and Markets: Reasoning about a Highly Connected World. By David Easley and Jon Kleinberg. Cambridge University Press, 2010. Complete preprint on-line at http://www.cs.cornell.edu/home/klei Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 2010-06-10 15:11:53 Triadic closure Triangle Flow network Graph Signed graph Binary tree Graph theory Mathematics Sociology
386	Acknowledgements Organising a workshop (however small) is a job that involves a lot of organisation. This workshop is no exception. There have been many people involved and we would like to take this opportunity to thank Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 07:07:08 Random regular graph Neighbourhood NP-complete problems Graph coloring Planar graphs Expander graph Graph theory Connectivity Graph
387	Preprint. To appear in Algorithmica. DOIs00453 – Online available. On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion Nadja Betzler1 · Hans L. Bodlaender · Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2012-10-16 08:46:15 NP-complete problems Graph operations Analysis of algorithms Parameterized complexity Feedback vertex set Tree decomposition Vertex cover Dominating set Kernelization Graph theory Theoretical computer science Mathematics
388	Willson Algorithms for Molecular Biology 2012, 7:13 http://www.almob.org/contentRESEARCH Open Access Add to Reading List Source URL: www.almob.org Language: English Complexity classes NP-complete problems Mathematical optimization NP P versus NP problem Graph Tree Directed graph Theoretical computer science Computational complexity theory Mathematics
389	Interval Scheduling and Colorful Independent Sets Ren´e van Bevern1,∗ , Matthias Mnich2 , Rolf Niedermeier1 , and Mathias Weller1,† 1 Institut f¨ Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2012-11-07 08:24:33 Clique Interval graph Independent set Claw-free graph Matching Cograph Path decomposition Maximal independent set Graph theory NP-complete problems Graph operations
390	Better bounds for matchings in the streaming model Michael Kapralov∗ July 26, 2012 Abstract In this paper we present improved bounds for approximating maximum matchings in bipartite graphs in Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2014-12-09 10:13:50 NP-complete problems Combinatorial optimization Matching Degree Maximum flow problem Graph coloring Dominating set Mathematics Graph theory Theoretical computer science

UPDATE